Bond graph modeling of centrifugal compression systems
نویسندگان
چکیده
منابع مشابه
Bond graph modeling of centrifugal compression systems
Abstract A novel method of modeling centrifugal compression systems for surge control purposes by using bond graphs is presented. By using the bond graph method, we get a simple description of compression systems based on physical phenomena and it is straight forward to get the dynamic equations. It is demonstrated that several active surge control methods can be represented by the same bond gr...
متن کاملActive surge control of centrifugal compression systems
This thesis addresses modeling and active surge control of a simple compression system, using only the drive system of the compressor for actuation. Theoretical results are validated by experiments on a test rig that was built as a part of this work. Control laws are derived in two stages. First all system states, such as pressure mass ‡ow and impeller speed, are assumed as available signals. A...
متن کاملBond-graph Modeling in Modelica
This paper discusses a bond–graph model library implemented in Modelica. Modelica is a new language for physical systems modeling with main objective to facilitate exchange of models and simulation specifications. Bond graphs are a domain–independent way of modeling the dynamics of physical systems. Besides the presentation of the Modelica basic bond– graph library, also an application example ...
متن کاملBond Graph Modelling of Engineering Systems
This chapter introduces the reader to the concept-oriented approach to modeling that clearly separates ideal concepts from the physical components of a system when modeling its dynamic behavior for a specific problem context. This is done from a port-based point of view for which the domain-independent bond graph notation is used, which has been misinterpreted over and over, due to the paradigm...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIMULATION
سال: 2015
ISSN: 0037-5497,1741-3133
DOI: 10.1177/0037549715612124